Computing strong and weak bisimulations for psi-calculi
نویسندگان
چکیده
منابع مشابه
Computing strong and weak bisimulations for psi-calculi
We present a symbolic transition system and strong and weak bisimulationequivalences for psi-calculi, and show that they are fully abstract with respectto bisimulation congruences in the non-symbolic semantics. An algorithmwhich computes the most general constraint under which two agents arebisimilar is developed and proved correct.A psi-calculus is an extension of the p...
متن کاملHigher-order psi-calculi
Psi-calculi is a parametric framework for extensions of the pi-calculus; in earlier work we have explored their expressiveness and algebraic theory. In this paper we consider higher-order psi-calculi through a technically surprisingly simple extension of the framework, and show how an arbitrary psi-calculus can be lifted to its higher-order counterpart in a canonical way. We illustrate this wit...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملWeak and Strong Beta Normalisations in Typed -calculi
We present a technique to study relations between weak and strong-normalisations in various typed-calculi. We rst introduce a translation which translates a-term into a I-term, and show that a-term is strongly-normalisable if and only if its translation is weakly-normalisable. We then prove that the translation preserves typability of-terms in various typed-calculi. This enables us to establish...
متن کاملWeak Bisimulations for Coalgebras over Ordered Functors
The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction prin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2012
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2012.01.001